A superlinear space decomposition algorithm for constrained nonsmooth convex program
نویسندگان
چکیده
منابع مشابه
The CoMirror algorithm for solving nonsmooth constrained convex problems
We introduce a first-order Mirror-Descent (MD) type algorithm for solving nondifferentiable convex problems having a combination of simple constraint set X (ball, simplex, etc.) and an additional functional constraint. The method is tuned to exploit the structure of X by employing an appropriate non-Euclidean distance-like function. Convergence results and efficiency estimates are derived. The ...
متن کاملA bundle-filter method for nonsmooth convex constrained optimization
For solving nonsmooth convex constrained optimization problems, we propose an algorithm which combines the ideas of the proximal bundle methods with the filter strategy for evaluating candidate points. The resulting algorithm inherits some attractive features from both approaches. On the one hand, it allows effective control of the size of quadratic programming subproblems via the compression a...
متن کاملA Pvt-type Algorithm for Minimizing a Nonsmooth Convex Function
A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a nonsmooth convex function is proposed, via the Moreau-Yosida regularization. As a particular scheme of this framework an ε-scheme is also presented. The global convergence of this algorithm is given under the assumptions of strong convexity of the objective function a...
متن کاملA Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem
Large scale nonsmooth convex optimization is a common problem for a range of computational areas including machine learning and computer vision. Problems in these areas contain special domain structures and characteristics. Special treatment of such problem domains, exploiting their structures, can significantly improve the computational burden. We present a weighted Mirror Descent method to so...
متن کاملA nonsmooth algorithm for cone-constrained eigenvalue problems
Such an eigenvalue problem arises in mechanics and in other areas of applied mathematics. The symbol K refers to a closed convex cone in the Euclidean space R and (A,B) is a pair of possibly asymmetric matrices of order n. Special attention is paid to the case in which K is the nonnegative orthant of R. The more general case of a possibly unpointed polyhedral convex cone is also discussed in de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2010
ISSN: 0377-0427
DOI: 10.1016/j.cam.2009.12.018